Theory of computation - PDFSEARCH.IO - Document Search Engine

Theory of computation
Results: 2087

#	Item
481	The Monad.Reader Issue 16 by Aran Donohue and John W. Lato and Louis Wasserman May 12, 2010 Add to Reading List Source URL: themonadreader.files.wordpress.com Language: English - Date: 2010-05-12 14:00:40 Models of computation Software engineering Computing Nondeterministic finite automaton Deterministic finite automaton Regular expression Monad Finite-state machine Regular language Automata theory Formal languages Theoretical computer science
482	AN EXPONENTIAL LOWER BOUND FOR THE LATEST DETERMINISTIC STRATEGY ITERATION ALGORITHMS OLIVER FRIEDMANN UNIVERSITY OF MUNICH e-mail address: A BSTRACT. This paper presents a new exponential lowe Add to Reading List Source URL: files.oliverfriedmann.de Language: English - Date: 2012-02-10 07:43:20 Formal languages Theory of computation Logic Game theory Determinacy Parity game
483	JMLR: Workshop and Conference Proceedings 34:94–108, 2014 Proceedings of the 12th ICGI Very efficient learning of structured classes of subsequential functions from positive data Add to Reading List Source URL: jmlr.org Language: English - Date: 2014-08-26 06:56:50 Models of computation Theoretical computer science Finite state transducer Metalogic Symbol Structure String Automata theory Formal languages Mathematics
484	Synthesis for Regular Specifications over Unbounded Domains Jad Hamza∗, Barbara Jobstmann†, Viktor Kuncak‡ ∗ ENS Cachan, France † CNRS/Verimag, France, ‡ EPFL, Switzerland Add to Reading List Source URL: lara.epfl.ch Language: English - Date: 2010-08-02 10:05:45 Mathematics Formal methods Nondeterministic finite automaton Linear temporal logic Finite-state machine Function Symbol Büchi automaton Automata theory Models of computation Theoretical computer science
485	Languages vs. ω-Languages in Regular Infinite Games Namit Chaturvedi? , Jörg Olschewski?? , and Wolfgang Thomas Lehrstuhl Informatik 7, RWTH Aachen University, Germany {chaturvedi,olschewski,thomas}@automata.rwth-aache Add to Reading List Source URL: www.automata.rwth-aachen.de Language: English - Date: 2012-05-29 11:02:51 Formal languages Computer science Theory of computation Ω-automaton Omega language Büchi automaton Symbol Determinacy Regular language Automata theory Mathematics Theoretical computer science
486	Models of Computation Lecture 4: Nondeterministic Automata [Fa’14] Caveat lector! This is the first edition of this lecture note. Some topics are incomplete, and there are almost certainly a few serious errors. Please Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:05:08 Applied mathematics Nondeterministic finite automaton Powerset construction Deterministic finite automaton Regular expression Finite-state machine Regular language Symbol String Automata theory Theoretical computer science Computer science
487	Models of Computation Lecture 3: Finite-State Machines [Fa’14] Caveat lector! This is the first edition of this lecture note. A few topics are missing, and there are almost certainly a few serious errors. Please send Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:05:05 Computer science DFA minimization Finite-state machine Deterministic finite automaton Nondeterministic finite automaton Automata theory Models of computation Theoretical computer science
488	Algorithms Appendix II: Solving Recurrences [Fa’13] Change is certain. Peace is followed by disturbances; departure of evil men by their return. Such recurrences should not constitute occasions for sadness but realiti Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:03:29 Asymptotic analysis Sorting algorithms Programming idioms Master theorem Recurrence relation Fibonacci number Factorial Quicksort Merge sort Mathematics Analysis of algorithms Theory of computation
489	PDF Document Add to Reading List Source URL: www.brics.dk Language: English - Date: 1996-10-15 05:57:12 Models of computation Type theory Data types Programming language implementation Logic in computer science Denotational semantics Partial evaluation Programming language Subtype polymorphism Software engineering Computing Programming language theory
490	Multi-Core Emptiness Checking of Timed B¨ uchi ∗ Automata using Inclusion Abstraction Alfons Laarman1 , Mads Chr. Olesen2 , Andreas Dalsgaard2 , Kim G. Larsen2 , and Jaco van de Pol1 Add to Reading List Source URL: people.cs.aau.dk Language: English - Date: 2013-06-13 05:44:50 Models of computation Deduction Entailment Logical consequence Metalogic S0 Cyan Advanced Configuration and Power Interface Finite-state machine Color Logic Automata theory

UPDATE